Advanced Scalarization of Array Syntax
نویسنده
چکیده
One task of all Fortran 90 compilers is to scalarize the array syntax statements of a program into equivalent sequential code. Most compilers require multiple passes over the program source to ensure correctness of this translation, since their analysis algorithms only work on the scalarized form. These same compilers then make additional subsequent passes to perform loop optimizations such as loop fusion. In this paper we discuss a strategy that is capable of making advanced scalarization and fusion decisions at the array level. We present an analysis strategy that supports our advanced scalarizer, and we describe the benefits of this methodology compared to the standard practice. Experimental results show that our strategy can significantly improve the runtime performance of compiled code, while at the same time improving the performance of the compiler itself.
منابع مشابه
Scalarizing Fortran 90 Array Syntax
Array syntax, existed in many languages, adds expressive power by allowing operations on and assignments to the array sections. When compiling to a uniprocessor machine, the array statement must be converted into a loop that maintains the correct semantics, by a process called scalarization. Scalarization presents a significant technical problem because an array assignment needs to be implement...
متن کاملWith-Loop Scalarization - Merging Nested Array Operations
Abstract. Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, näıve compilation of such specifications leads to creation of many temporary arrays at runtime and, consequently, to poor performance characteristics. This paper elaborates on a new compiler optimization, named withloop-scalarization, ...
متن کاملRestricting the parameter set of the Pascoletti-Serafini scalarization
A common approach to determine efficient solutions of a multiple objective optimization problem is reformulating it to a parameter dependent scalar optimization problem. This reformulation is called scalarization approach. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered. First, some difficulties of this scalarization are discussed and then ...
متن کاملCoincidence point and common fixed point results via scalarization function
The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. Next, we obtain cone $b$-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.
متن کاملConic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantee to generate all proper efficient solutions and does not require any kind of cenvexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideretion by this method. Also in this paper,...
متن کامل